Process Algebra with Data
نویسندگان
چکیده
We provide rules for calculating with invariants in process algebra with data, and illustrate these with examples. The new rules turn out to be equivalent to the well known Recursive Specification Principle which states that guarded recursive equations have at most one solution. In the setting with data this is reformulated as `every convergent linear process operator has at most one fixed point' (CL-RSP). As a consequence, one can carry out verifications in well-known process algebras satisfying CL-RSP using invariants.
منابع مشابه
New Solutions for Fokker-Plank Equation of Special Stochastic Process via Lie Point Symmetries
In this paper Lie symmetry analysis is applied in order to find new solutions for Fokker Plank equation of Ornstein-Uhlenbeck process. This analysis classifies the solutions format of the Fokker Plank equation by using the Lie algebra of the symmetries of our considered stochastic process.
متن کاملMeadow Enriched ACP Process Algebras
We introduce the notion of an ACP process algebra. The models of the axiom system ACP are the origin of this notion. ACP process algebras have to do with processes in which no data are involved. We also introduce the notion of a meadow enriched ACP process algebra, which is a simple generalization of the notion of an ACP process algebra to processes in which data are involved. In meadow enriche...
متن کاملReasoning about data in a simple process algebra
Various process algebras have been introduced for reasoning about concurrent systems. Some of them include explicit data-passing mechanisms, while others do not. This paper presents a non-trivial problem involving data, which can also be comprehensively solved with a simple process algebra without explicit data-passing. The presented problem is very suitable for comparing the strength of differ...
متن کاملLocated Actions in Process Algebra with Timing
We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, 2002, Chap. 4] to spatially located actions. This process algebra makes it possible to deal with the behaviour of systems with a known time-dependent spatial distribution, such as protocols transmitting data via a mobile interme...
متن کاملProcess algebraic modeling of authentication protocols for analysis of parallel multi-session executions
Many security protocols have the aim of authenticating one agent acting as initiator to another agent acting as responder and vice versa. Sometimes, the authentication fails because of executing several parallel sessions of a protocol, and because an agent may play both the initiator and responder role in parallel sessions. We take advantage of the notion of transition systems to specify authen...
متن کاملAlternative quanti cation vs . input pre xingJan
This is a summary of our paper \Process algebras with alternative quantii-cation over data" (Groote and Luttik (1998)). In this paper, we deene a class of process algebras with a generalised operation P that allows explicit treatment of alternative quantiication over data, and investigate the speciic subclass formed by the algebras of nite processes modulo strong bisimulation. We have shown tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993